摘要 :
Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality-of-Service (QoS), security, etc. To design an overlay network, the first s...
展开
Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality-of-Service (QoS), security, etc. To design an overlay network, the first step is to choose an overlay topology connecting all the overlay service nodes. When considering overlay topologies, several questions need to be answered first: How overlay topologies affect overlay routing performance? Which topologies can provide satisfactory performance? How can we construct efficient overlay topologies connecting all the overlay nodes? In this paper, we focus on the overlay network topology construction issue. First, we evaluate and compare the performance and overhead of the existing overlay topologies. Second, we formalize the overlay topology construction problem and propose two new heuristic methods to construct efficient overlay topologies. Simulation results have demonstrated the efficiency of the two proposed approaches. It is shown that overlay service performance varies significantly with respect to different overlay topologies. Thus, it is important to choose an appropriate overlay network topology. The knowledge of IP-layer topology information also benefits significantly in constructing efficient overlay topologies as inferred from the results.
收起
摘要 :
A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes...
展开
A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes, using an overlay network. Developing cost-efficient overlay routing in terms of calculation cost and information distribution cost needed to find an alternative route is important for deploying QoS-aware overlay routing. Thus, this paper evaluates how effective overlay routing can be when the number of alternative route candidates is limited to reduce costs. Evaluation results using actual measurement data indicate that overlay routing is still effective even if alternative route candidates are limited to 1/4 of all possible alternative routes. We also discuss an overlay routing algorithm to enable us to find an appropriate route under the constraint that the number of alternative route candidates is limited.
收起
摘要 :
We take note, from the viewpoint of the enterprise user, of IP core networks, overlay networks and communication services, with regard to cloud computing systems. The current approach to building overlay networks, overlay node (ON...
展开
We take note, from the viewpoint of the enterprise user, of IP core networks, overlay networks and communication services, with regard to cloud computing systems. The current approach to building overlay networks, overlay node (ON) and routing node (RN) inside common network are connected directly, has problems in terms of reliability and security. An improved architecture, the "Service-over-core network' as network framework, is described. Each service is built by connecting its access networks and service management sites, which may include similar servers, to end nodes placed at the periphery of the core network. We think that the faults of dependable overlay network, in terms of business use and security, can be overcome by modifying its basic structure into the service-over-core network.
收起
摘要 :
We take note, from the viewpoint of the enterprise user, of IP core networks, overlay networks and communication services, with regard to cloud computing systems. The current approach to building overlay networks, overlay node (ON...
展开
We take note, from the viewpoint of the enterprise user, of IP core networks, overlay networks and communication services, with regard to cloud computing systems. The current approach to building overlay networks, overlay node (ON) and routing node (RN) inside common network are connected directly, has problems in terms of reliability and security. An improved architecture, the "Service-over-core network" as network framework, is described. Each service is built by connecting its access networks and service management sites, which may include similar servers, to end nodes placed at the periphery of the core network. We think that the faults of dependable overlay network, in terms of business use and security, can be overcome by modifying its basic structure into the service-over-core network.
收起
摘要 :
This article presents a survey of recent advancements in application-layer overlay networks. Some of the most important applications that have been proposed for overlays include multicast, QoS support, denial-of-service (DoS) defe...
展开
This article presents a survey of recent advancements in application-layer overlay networks. Some of the most important applications that have been proposed for overlays include multicast, QoS support, denial-of-service (DoS) defense, and resilient routing. We look at some of the important approaches proposed for these applications and compare the advantages and disadvantages of these approaches. We also examine some of the enhancements that have been proposed in overlay topology design, enhanced routing performance, failure resistance, and the issues related to coexistence of overlay and native layers in the Internet. We conclude the article with a comment on the purist vs pluralist argument of overlay networks that has received much debate recently. Finally, we propose a new deployment model for service overlays that seeks to interpose between these two approaches.
收起
摘要 :
We consider the problem of architecting a reliable content delivery system across an overlay network using TCP connections as the transport primitive. We first argue that natural designs based on store-and-forward principles that ...
展开
We consider the problem of architecting a reliable content delivery system across an overlay network using TCP connections as the transport primitive. We first argue that natural designs based on store-and-forward principles that tightly couple TCP connections at intermediate end-systems impose fundamental performance limitations, such as dragging down all transfer rates in the system to the rate of the slowest receiver. In contrast, the ROMA architecture we propose incorporates the use of loosely coupled TCP connections together with fast forward error correction techniques to deliver a scalable solution that better accommodates a set of heterogeneous receivers. The methods we develop establish chains of TCP connections, whose expected performance we analyze through equation-based methods. We validate our analytical findings and evaluate the performance of our ROMA architecture using a prototype implementation via extensive Internet experimentation across the PlanetLab distributed testbed.
收起
摘要 :
Various overlay networks have been proposed and developed to improve the flexibility of networks and to address the issues associated with IP networks. However, the existing overlay networks have two problems: (1) performance degr...
展开
Various overlay networks have been proposed and developed to improve the flexibility of networks and to address the issues associated with IP networks. However, the existing overlay networks have two problems: (1) performance degradation due to full-mesh tunneling and (2) increase in development cost due to the tightly coupled control and data planes. To solve these problems, we introduce a new abstraction layer for overlay networks in the existing network layering model. Based on the layering model, we designed and implemented a protocol stack, called ovstack, as a common data plane for overlay networks. In this manuscript, we describe the details of ovstack and of two control plane systems as a proof-of-concept. We evaluate the forwarding performance of ovstack and demonstrate the control plane systems. The results of the performance evaluation show that the average delay of packet forwarding is decreased by 12% and that jitter is 8% lower than one of the existing overlays. Our evaluations confirm that ovstack can contribute to the construction of overlay networks for each requirement on current networks. (C) 2015 Elsevier B.V. All rights reserved.
收起
摘要 :
Recently, overlay networks are gaining attention as a means to eliminate single point of failure in the application layer. This paper focuses on secure routing in overlay networks. A threat model is presented, along with our count...
展开
Recently, overlay networks are gaining attention as a means to eliminate single point of failure in the application layer. This paper focuses on secure routing in overlay networks. A threat model is presented, along with our countermeasure proposal. Our proposal consists of blind forwarding, distributed trust anchor, and probabilistic testing. Unlike previous contributions on this topic, our proposal is based on trust anchor. Furthermore, we attempt to reconstruct the threat model, based on the insights gained from previous contributions. We also briefly describe our phase-1 development efforts of a software framework that implements essential functions of secure overlay. Our software framework attempts to address application-specific threat models.
收起
摘要 :
Recently, many overlay applications have emerged in the Internet. Currently, each of these applications requires their proprietary functionality support. A general unified framework may be a desirable alternative to application-sp...
展开
Recently, many overlay applications have emerged in the Internet. Currently, each of these applications requires their proprietary functionality support. A general unified framework may be a desirable alternative to application-specific overlays. We introduce the concept of overlay brokers (OBs). We assume that each autonomous system in the Internet has one or more OBs. These OBs cooperate with each other to form an overlay service network (OSN) and provide overlay service support for overlay applications, such as resource allocation and negotiation, overlay routing, topology discovery, and other functionalities. The scope of our effort is the support of quality-of-service (QoS) in overlay networks. Our primary focus is on the design of QoS-aware routing protocols for overlay networks (QRONs). The goal of QRON is to find a QoS-satisfied overlay path, while trying to balance the overlay traffic among the OBs and the overlay links in the OSN. A subset of OBs, connected by the overlay paths, can form an application specific overlay network for an overlay application. The proposed QRON algorithm adopts a hierarchical methodology that enhances its scalability. We analyze two different types of path selection algorithms. We have simulated the protocols based on the transit-stub topologies produced by GT-ITM. Simulation results show that the proposed algorithms perform well in providing a QoS-aware overlay routing service.
收起
摘要 :
Recent advances in information theory show that the throughput of a multicast session can be improved using network coding. In overlay networks, the available bandwidth between sender and different receivers are different. In this...
展开
Recent advances in information theory show that the throughput of a multicast session can be improved using network coding. In overlay networks, the available bandwidth between sender and different receivers are different. In this paper, we propose a solution to improve the throughput of an overlay multicast session with heterogeneous receivers by organizing the receivers into layered data distribution meshes and sending substreams to each mesh using layered coding. Our solutions utilize alternative paths and network coding in each mesh. We first formulate the problem into a mathematical programming, whose optimal solution requires global information. We therefore present a distributed heuristic algorithm. The heuristic progressively organizes the receivers into layered meshes. Each receiver can subscribe to a proper number of meshes to maximize its throughput by fully utilizing its available bandwidth. The benefits of organizing the topology into layered mesh and using network coding are demonstrated through extensive simulations. Numerical results indicate that the average throughput of a multicast session is significantly improved (up to 50% to 60%) with only slightly higher delay and network resource consumption.
收起
原文获取